/*
#include<bits/stdc++.h>
using namespace std;
int main()
{
  //1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 
  int n;
  cin >> n;
  double m;
  int a = 1, b = 1, i = 1;
  if(n == 1)
    printf("1.000000");
  else
  {
	  while(i < n)
	  {
	    int c = a + b;
	    a = b;
	    b = c;
	    i ++;
	    m = (double) a / b; 
	  }
	  printf("%.8lf", m);  	
  }
  return 0;
}
*/
/*
#include<bits/stdc++.h>
using namespace std;
int main()
{
  long long n;
  long long a = 1, b = 1, i = 3;
  double m;
  cin >> n;
  if(n == 1)
  printf("1.00000000");
  else if(n == 2)
    printf("0.50000000");
  else
  {
    while(i <= n + 1)
	{
	    long long c = a + b;
	    a = b;
	    b = c;
	    m = (double)a / b;
	    i ++;		
	}

  }
  printf("%.8llf", m);
  return 0;
}
*/
/*
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, k;
int f[N];
int main()
{
  cin >> n;
  int sum = 0;
  for (int i = 0; i < n; i ++)
  {
    scanf("%d",&f[i]);
  }
  for (int i = 0; i < n; i ++)
  {
    printf("%d ",f[i]);
  }
  return 0;
}
*/
/*
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, k;
int q[N];
int main()
{
  cin >> n >> k;
  int sum = 0;
  int ans = 0;
  for (int i = 0; i < n; i ++)
  {
    scanf("%d",&q[i]);
  }
  for (int i = 0; i < n; i ++)
  {
      for (int j = i; j < n; j ++)
      {
        for (int b = i; b <= j; b ++)
        {
          sum += q[b];
          if(sum % k == 0 && sum != 0)
            ans ++;
        }
        sum = 0;
      }
  }
  cout << ans <<endl;
  return 0;
}
*/
















